Probabilistic Proof Systems Lecture Notes

Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In these notes, we concentrate on three such proof systems | interactive proofs, zero-knowledge proofs, and probabilistic checkable proofs. Remark: These are lecture notes in the strict sense of the word. Surveys of mine on this subject can be obtained from URL http://theory.lcs.mit.edu/~oded/pps.html. These notes were prepared for a series of lectures given in the Theory Student Seminar of the CS Department of UC-Berkeley. Visiting Miller Professor, Aug. { Sept. 1996, EECS Dept., UC{Berkeley.